منابع مشابه
Hierarchical Overlap Graph
Given a set of finite words, the Overlap Graph (OG) is a complete weighted digraph where each word is a node and where the weight of an arc equals the length of the longest overlap of one word onto the other (Overlap is an asymmetric notion). The OG serves to assemble DNA fragments or to compute shortest superstrings which are a compressed representation of the input. The OG requires a space is...
متن کاملOverlap Interfaces in Hierarchical Spin - Glass models
We discuss interfaces in spin glasses. We present new theoretical results and a numerical method to characterize overlap interfaces and the stability of the spinglass phase in extended disordered systems. We use this definition to characterize the low temperature phase of hierarchical spin-glass models. We use the Replica Symmetry Breaking theory to evaluate the cost for an overlap interface, w...
متن کاملArbitrary Overlap Constraints in Graph Packing Problems
In earlier versions of the community discovering problem, the overlap between communities was restricted by a simple count upperbound [17,5,11,8]. In this paper, we introduce the Π-Packing with α()Overlap problem to allow for more complex constraints in the overlap region than those previously studied. Let V be all possible subsets of vertices of V (G) each of size at most r, and α : V × V → {0...
متن کاملFast Node Overlap Removal in Graph Layout
Most graph layout algorithms in the field of graph drawing treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height do not overlap, yet are as close as possible to their original positions. We give an O(n logn) algorithm for achieving this assuming that the number of nodes overlapping any single node ...
متن کاملThe overlap number of a graph
An overlap representation is an assignment of sets to the vertices of a graph in such a way that two vertices are adjacent if and only if the sets assigned to them overlap. The overlap number of a graph is the minimum number of elements needed to form such a representation. We find the overlap numbers of cliques and complete bipartite graphs by relating the problem to previous research in combi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2019.105862